9-Connected Claw-Free Graphs Are Hamilton-Connected
نویسندگان
چکیده
منابع مشابه
On 1-Hamilton-connected claw-free graphs
A graph G is k-Hamilton-connected (k-hamiltonian) if G−X is Hamilton-connected (hamiltonian) for every setX ⊂ V (G) with |X| = k. In the paper, we prove that (i) every 5-connected claw-free graph with minimum degree at least 6 is 1Hamilton-connected, (ii) every 4-connected claw-free hourglass-free graph is 1-Hamilton-connected. As a byproduct, we also show that every 5-connected line graph with...
متن کاملHourglasses and Hamilton cycles in 4-connected claw-free graphs
We show that if G is a 4-connected claw-free graph in which every induced hourglass subgraph S contains two non-adjacent vertices with a common neighbor outside S, then G is hamiltonian. This extends the fact that 4-connected claw-free, hourglass-free graphs are hamiltonian, thus proving a broader special case of a conjecture by Matthews and Sumner.
متن کاملQuadrangularly connected claw-free graphs
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4) C1, C2, ..., Cr such that e1 ∈ E(C1) and e2 ∈ E(Cr) and E(Ci) ∩ E(Ci+1) 6= ∅ for i = 1, 2, ..., r − 1. In this paper, we show that every quadrangularly connected claw-free graph without vertices of degree 1, which does not contain an induced subgraph H isomorphic to eithe...
متن کاملClaw-free 3-connected P11-free graphs are hamiltonian
We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P12 this result is, in a way, best possible. 1. Statement of the main result A graph G is {H1, H2, . . . Hk}-free if G contains no induced subgraphs isomorphic to any of the graphs Hi, i = 1, 2, . . . , k. A...
متن کاملHamiltonian N2-locally connected claw-free graphs
A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1999
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1871